Scrambling as the Combination of Relaxed Context-Free Grammars in a Model-Theoretic Grammar Formalism

نویسنده

  • Ralph Debusmann
چکیده

Recently (Rogers, 2004), there have been attempts to step out of the shadow of GES, and to use MTS not only to reformulate and compare existing frameworks, but to utilize the more declarative, clarifying perspective of MTS to also explore extensions of them. This is what we set out to do in this paper as well. We base our work on the model-theoretic meta grammar formalism of Extensible Dependency Grammar (XDG) (Debusmann, 2006). XDG can be used to axiomatize grammatical theories based on dependency grammar, to extend them, and to implement them using the constraint-based XDG Development Kit (XDK) (Debusmann et al., 2004), (Debusmann and Duchier, 2007). XDG is novel in supporting the axiomatization of multi-dimensional grammatical theories, where the linguistic aspects of e.g. syntax and semantics can be modeled modularly by separate dependency analyses.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Studying impressive parameters on the performance of Persian probabilistic context free grammar parser

In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...

متن کامل

Parsing Complexity and Model-Theoretic Syntax

As a primarily declarative approach, model theoretic syntax focuses the manner we formalize and describe the syntax of natural languages. However, in practice, we often make the experience that such formalisms suffer from excessive complexity. Depending on the underlying logical formalism, the complexity of proving the validity or satisfiability of a given (set of) formula(e) is typically EXPTI...

متن کامل

Conjunctive Grammars 1

This paper introduces a class of formal grammars made up by augmenting the formalism of context-free grammars with an explicit set-theoretic intersection operation. It is shown that conjunctive grammars can generate some important non-context-free language constructs, including those not in the intersection closure of context-free languages, and that they can provide very succinct descriptions ...

متن کامل

Conjunctive Grammars

This paper introduces a class of formal grammars made up by augmenting the formalism of context-free grammars with an explicit set-theoretic intersection operation. It is shown that conjunctive grammars can generate some important non-contextfree language constructs, including those not in the intersection closure of context-free languages, and that they can provide very succinct descriptions o...

متن کامل

Towards a Model-Theoretic Characterization of Indexed Grammars

The strong generative capacity of a certain type of indexed grammar is investigated within a model-theoretic framework. Such grammars are found to be equivalent in capacity to a certain fragment of a language obtained by the addition of unary function variables to a monadic second-order language previously used to characterize the context-free grammars.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007